Successive survivable routing for node failures
نویسندگان
چکیده
This paper addresses the spare capacity allocation (SCA) problem considering any single node failure in mesh networks. The SCA node failure problem aims at finding backup routes and providing sufficient spare capacity to protect traffic when any single node fails in communication network. Here, we introduce our novel matrix formulation of the arc-flow SCA node failure model. In this model, working paths are given before pre-planned backup paths are routed and reserved. Because backup paths can not be guaranteed if general shortest path routing of working paths is used, we give a graph algorithm to find working path which has at least one node-disjoint backup path. We extend our recent approximation algorithm, successive survivable routing (SSR), to solve the above SCA model. Numerical comparison shows that SSR has the best trade-off between solution optimality and computation speed. Keywords— spare capacity allocation, protection and restoration, network planning and optimization, network survivability
منابع مشابه
Survivable routing in IP-over-WDM networks: An efficient and scalable local search algorithm
In IP-over-WDM networks, a logical IP network is routed on top of a physical optical fiber network. An important challenge hereby is to make the routing survivable. We call a routing survivable if the connectivity of the logical network is guaranteed in case of a failure in the physical network. In this paper we describe FastSurv, a local search algorithm for survivable routing. The algorithm w...
متن کاملGraph transformation approaches for diverse routing in shared risk resource group (SRRG) failures
Failure resilience is a desired feature of the Internet. Most traditional restoration architectures assume single-failure assumption, which is not adequate in present day WDM optical networks. Multiple link failure models, in the form of Shared-Risk Link Groups (SRLG’s) and Shared Risk Node Groups (SRNG’s) are becoming critical in survivable optical network design. We classify both of these for...
متن کاملSurvivable Mapping Algorithm by Ring Trimming
We develop a fast and efficient algorithm that finds a survivable (i.e., robust to single fiber failures) mapping of IP topology on the mesh of fibers in IP-over-WDM networks; we call it SMART. A number of algorithms solving this problem can be found in the literature. Since ILP solutions are highly complex, many heuristics were proposed. They usually start with some initial mapping and then tr...
متن کاملDesigning Survivable Networks with Directed Cycles for Routing Disrupted Flow
A telecommunications network may be represented as a graph where the edges correspond to transmission cables carrying signals between nodes that represent users. Associated with pairs of users is a traffic demand which must flow through the network. We are interested in installing integer multiples of capacity on the edges and routing the demand through the network while minimizing total (capac...
متن کاملCross Layer Network Survivability in Cross-layer Metrices and Shortest Path Identification Usig Aco
In layered networks, a single failure at a lower layer may cause multiple failures in the upper layers. As a result, traditional schemes that protect against single failures may not be effective in cross-layer networks. A cross layer network with logical and physical topologies, the survivable logical topology routing problem is to route each link in the logical layer with a path in the physica...
متن کامل